Unoriented strings, loop equations, andN=1superpotentials from matrix models
نویسندگان
چکیده
منابع مشابه
Two-Dimensional Unoriented Strings And Matrix Models
We investigate unoriented strings and superstrings in two dimensions and their dual matrix quantum mechanics. Most of the models we study have a tachyon tadpole coming from the RP 2 worldsheet which needs to be cancelled by a renormalization of the worldsheet theory. We find evidence that the dual matrix models describe the renormalized theory. The singlet sector of the matrix models is integra...
متن کاملLoop equations for multi - cut matrix models
The loop equation for the complex one-matrix model with a multi-cut structure is derived and solved in the planar limit. An iterative scheme for higher genus contributions to the free energy and the multi-loop correlators is presented for the two-cut model, where explicit results are given up to and including genus two. The double-scaling limit is analyzed and the relation to the one-cut soluti...
متن کاملOpen and Unoriented Strings from Topological Membrane I. Prolegomena
We study the orbifold of Topological Membrane (TM), a Topological Massive Gauge Theory (TMGT), defined in S × [0, 1] and T 2 × [0, 1]. The orbifolding is constructed by gauging discrete symmetries of the bulk 3D field theory, namely PCT/PT symmetries. We consider several generalized definitions of parity, depending on these choices we obtain open, open unoriented and close unoriented theories. ...
متن کاملSelfdual strings and loop space Nahm equations
We give two independent arguments why the classical membrane fields should be take values in a loop algebra. The first argument comes from how we may construct selfdual strings in the M5 brane from a loop space version of the Nahm equations. The second argument is that there appears to be no infinite set of finite-dimensional Lie algebras (such as su(N) for any N) that satisfies the algebraic s...
متن کاملLongest common subsequence problem for unoriented and cyclic strings
Given a finite set of strings X, the Longest Common Subsequence problem (LCS) consists in finding a subsequence common to all strings in X that is of maximal length. LCS is a central problem in stringology and finds broad applications in text compression, conception of error-detecting codes, or biological sequence comparison. However, in numerous contexts words represent cyclic or unoriented se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review D
سال: 2003
ISSN: 0556-2821,1089-4918
DOI: 10.1103/physrevd.67.086004